Adaptive memetic differential evolution with niching competition and supporting archive strategies for multimodal optimization
نویسندگان
چکیده
Multimodal optimization, which aims at locating multiple optimal solutions within the search space, is inherently a difficult problem. This work proposes an adaptive memetic differential evolution algorithm with niching competition and supporting archive strategies to tackle In proposed algorithm, strategy designed competitively employ niches according their potentials by encouraging high potential for exploitation while low exploration, thus appropriately searching space identify optima . Further, devised implemented niche level dual purpose of helping maintain as well facilitate population. this strategy, writing reading implicitly during rather than requiring external rules. Additionally, Cauchy-based local scheme, considers possible locations implement search, developed incorporated into method efficiently properly improve seeds. The resulting has been evaluated extensive experiments on benchmark functions robot kinematics problem compared related methods. results show that our able consistently accurately locate in solution outperform
منابع مشابه
Region-based memetic algorithm with archive for multimodal optimisation
In this paper we propose a specially designed memetic algorithm for multimodal optimisation problems. The proposal uses a niching strategy, called region-based niching strategy, that divides the search space in predefined and indexable hypercubes with decreasing size, called regions. This niching technique allows our proposal to keep high diversity in the population, and to keep the most promis...
متن کاملSupporting Information for: “Memetic Viability Evolution for Constrained Optimization”
is a candidate solution to the problem at hand. The reason for focusing our research on problems with inequalities only was threefold. The first reason, is purely algorithmic: the CMA-ES structure is indeed not feasible when the volume of the feasible region reduces to zero (which is the case of equality constraints). We discuss this aspect more in detail in Section 3. Secondly, specific techni...
متن کاملBenchmark Functions for CEC’2013 Special Session and Competition on Niching Methods for Multimodal Function Optimization
Population-based meta-heuristic algorithms such as Evolutionary Algorithms (EAs) in their original forms are usually designed for locating a single global solution. These algorithms typically converge to a single solution because of the global selection scheme used. Nevertheless, many realworld problems are “multimodal” by nature, i.e., multiple satisfactory solutions exist. It may be desirable...
متن کاملA Memetic Differential Evolution Algorithm with Adaptive Mutation Operator
Differential evolution algorithm has been widely used, because of its efficient optimization and no complex operation and coding mechanism. But DE falls into the local optimum easily. So this study puts forward a memetic algorithm. The algorithm can increase the diversity of population and jump out the local extreme value point effectively. The convergence speed of the algorithm is improved, be...
متن کاملA Cumulative Multi-Niching Genetic Algorithm for Multimodal Function Optimization
This paper presents a cumulative multi-niching genetic algorithm (CMN GA), designed to expedite optimization problems that have computationally-expensive multimodal objective functions. By never discarding individuals from the population, the CMN GA makes use of the information from every objective function evaluation as it explores the design space. A fitness-related population density control...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2021
ISSN: ['0020-0255', '1872-6291']
DOI: https://doi.org/10.1016/j.ins.2021.04.093